A Compromise Programming for Multi-Objective Task Assignment Problem

نویسندگان

چکیده

The problem of scheduling is an area that has attracted a lot attention from researchers for many years. Its goal to optimize resources in the system. lecturer’s assigning task example timetabling problem, class scheduling. This study introduces mathematical model assign constrained tasks (the time and required skills) university lecturers. Our capable generating calendar maximizes faculty expectations. formulated form multi-objective requires trade-off between two or more conflicting objectives indicate optimal solution. We use compromise programming approach solve this. then proposed new version Genetic Algorithm introduced model. Finally, we tested algorithm with real data, including 139 sections 17 subjects 27 lecturers 10 timeslots. web application supports decision-maker visualize manipulate obtained results.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Nadir Compromise Programming for Supplier Selection Problem under Uncertainty

Supplier selection is one of the influential decisions for effectiveness of purchasing and manufacturing policies under competitive conditions of the market. Regarding the fact that decision makers (DMs) consider conflicting criteria for selecting suppliers, multiple-criteria programming is a promising approach to solve the problem. This paper develops a nadir compromise programming (NCP) model...

متن کامل

A New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem

Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...

متن کامل

A Compromise Decision-making Model for Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty

This paper proposes a compromise model, based on the technique for order preference through similarity ideal solution (TOPSIS) methodology, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. This compromise programming method is ba...

متن کامل

Nadir compromise programming: A model for optimization of multi-objective portfolio problem

In problem of portfolio selection, financial Decision Makers (DMs) explain objectives and investment purposes in the frame of multi-objective mathematic problems which are more consistent with decision making realities. At present, various methods have introduced to optimize such problems. One of the optimization methods is the Compromise Programming (CP) method. Considering increasing importan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers

سال: 2021

ISSN: ['2073-431X']

DOI: https://doi.org/10.3390/computers10020015